Supervised Scoring with Monotone Multidimensional Splines
نویسنده
چکیده
Scoring involves the compression of a number of quantitative attributes into a single meaningful value. We consider the problem of how to generate scores in a setting where they should be weakly monotone (either non-increasing or non-decreasing) in their dimensions. Our approach allows an expert to score an arbitrary set of points to produce meaningful, continuous, monotone scores over the entire domain, while exactly interpolating through those inputs. In contrast, existing monotone interpolating methods only work in two dimensions and typically require exhaustive grid input. Our technique significantly lowers the bar to score creation, allowing domain experts to develop mathematically coherent scores. The method is used in practice to create the LEED Performance scores that gauge building sustainability.
منابع مشابه
Nonmetric multidimensional scaling: Neural networks versus traditional techniques
In this paper we consider various methods for nonmetric multidimensional scaling. We focus on the nonmetric phase, for which we consider various alternatives: Kruskal’s nonmetric phase, Guttman’s nonmetric phase, monotone regression by monotone splines, and monotone regression by a monotone neural network. All methods are briefly described. We use sequential quadratic programming to estimate th...
متن کاملOn k-Monotone Approximation by Free Knot Splines
Let SN,r be the (nonlinear) space of free knot splines of degree r − 1 with at most N pieces in [a, b], and let M be the class of all k-monotone functions on (a, b), i.e., those functions f for which the kth divided difference [x0, . . . , xk]f is nonnegative for all choices of (k+1) distinct points x0, . . . , xk in (a, b). In this paper, we solve the problem of shape preserving approximation ...
متن کاملInference Using Shape - Restricted Regression Splines
Regression splines are smooth, flexible, and parsimonious nonparametric function estimators. They are known to be sensitive to knot number and placement, but if assumptions such as monotonicity or convexity may be imposed on the regression function, the shaperestricted regression splines are robust to knot choices. Monotone regression splines were introduced by Ramsay [Statist. Sci. 3 (1998) 42...
متن کاملOn monotone and convex approximation by splines with free knots
We prove that the degree of shape preserving free knot spline approximation in L p a; b], 0 < p 1 is essentially the same as that of the non-constrained case. This is in sharp contrast to the well known phenomenon we have in shape preserving approximation by splines with equidistant knots and by polynomials. The results obtained are valid both for piecewise polynomials and for smooth splines wi...
متن کاملOn Monotone and Convex Spline Interpolation*
This paper is concerned with the problem of existence of monotone and/or convex splines, having degree n and order of continuity k, which interpolate to a set of data at the knots. The interpolating splines are obtained by using Bernstein polynomials of suitable continuous piecewise linear functions; they satisfy the inequality k < n — k. The theorems presented here are useful in developing alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014